On the hardness of efficiently approximating maximal non-L submatrices
نویسندگان
چکیده
منابع مشابه
on the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn the hardness of approximating label-cover
The LABEL-COVER problem, defined by S. Arora, L. Babai, J. Stern, Z. Sweedyk [Proceedings of 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 724–733], serves as a starting point for numerous hardness of approximation reductions. It is one of six ‘canonical’ approximation problems in the survey of Arora and Lund [Hardness of Approximations, in: Approximation Algorithms for NP-H...
متن کاملOn the hardness of approximating Max-Satisfy
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NP⊂BPP Max-Satisfy cannot be efficiently approximated within an approximation ratio of 1/n1−2, if we consider systems of n linear equations with at most n variables and 2 > 0 is an arbitrarily small constant. Previously, it was known tha...
متن کاملHardness of Approximating Problems on Cubic Graphs
Four fundamental graph problems, Minimum vertex cover, Maximum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. This means that unless P=NP these problems do not admit any polynomial time approximation scheme on input graphs of degree bounded by three.
متن کاملOn the Hardness of Approximating the Minimum Consistent OBDD Problem
Ordered binary decision diagrams (OBDD, for short) represent Boolean functions as directed acyclic graphs. The minimum consistent OBDD problem is, given an incomplete truth table of a function, to nd the smallest OBDD that is consistent with the truth table with respect to a xed variable ordering. We show that this problem is NP-hard, and prove that there is a constant > 0 such that no polynomi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2004
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.08.014